CountablyQC-Approximating Posets

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Countably QC-Approximating Posets

As a generalization of countably C-approximating posets, the concept of countably QC-approximating posets is introduced. With the countably QC-approximating property, some characterizations of generalized completely distributive lattices and generalized countably approximating posets are given. The main results are as follows: (1) a complete lattice is generalized completely distributive if and...

متن کامل

Plane posets, special posets, and permutations

We study the self-dual Hopf algebra HSP of special posets introduced by Malvenuto and Reutenauer and the Hopf algebra morphism from HSP to the Hopf algebra of free quasi-symmetric functions FQSym given by linear extensions. In particular, we construct two Hopf subalgebras both isomorphic to FQSym; the first one is based on plane posets, the second one on heap-ordered forests. An explicit isomor...

متن کامل

Signed Posets

We define a new object, called a signed poset, that bears the same relation to the hyperoctahedral group B n (i.e., signed permutations on n letters), as do posets to the symmetric group S n. We then prove hyperoctahedral analogues of the following results: (1) the generating function results from the theory of P-partitions; (2) the fundamental theorem of finite distributive lattices (or Birkho...

متن کامل

Tchebyshev Posets

We construct for each n an Eulerian partially ordered set Tn of rank n + 1 whose ce-index provides a non-commutative generalization of the n-th Tchebyshev polynomial. We show that the order complex of each Tn is shellable, homeomorphic to a sphere, and that its face numbers minimize the expression max|x|≤1 ∣∣∣∑nj=0(fj−1/fn−1) · 2−j · (x− 1)j∣∣∣ among the f -vectors of all (n − 1)-dimensional si...

متن کامل

Boolean Posets, Posets under Inclusion and Products of Relational Structures1

In this paper X denotes a set. Let L be a lattice. Note that Poset(L) has l.u.b.’s and g.l.b.’s. Let L be an upper-bounded lattice. One can verify that Poset(L) is upper-bounded. Let L be a lower-bounded lattice. One can verify that Poset(L) is lower-bounded. Let L be a complete lattice. Note that Poset(L) is complete. Let X be a set. Then X is an order in X . Let X be a set. The functor 〈X ,⊆〉...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Scientific World Journal

سال: 2014

ISSN: 2356-6140,1537-744X

DOI: 10.1155/2014/123762